Accelerating Phylogenetics Using FPGAs in the Cloud
نویسندگان
چکیده
Phylogenetics study the evolutionary history of organisms using an iterative process creating and evaluating phylogenetic trees. This is very computationally intensive; constructing a large tree requires hundreds to thousands CPU hours. In this article, we describe FPGA-based system that can be deployed on AWS EC2 F1 cloud instances accelerate analyses by boosting performance likelihood function, i.e., widely employed tree-evaluation function accounts for up 95% overall analysis time. We exploit domain-specific knowledge reduce amount transferred data limits performance. Our proof-of-concept implementation reveals effective accelerator throughput nearly quadruples with optimized movement, reaching 75% its theoretical peak 10× faster processing than AVX2 extensions.
منابع مشابه
Accelerating the CKY Parsing Using FPGAs
The main contribution of this paper is to present an FPGA-based implementation of an instance-specific hardware which accelerates the CKY (Cocke-Kasami-Younger) parsing for context-free grammars. Given a context-free grammar G and a string x, the CKY parsing determines whether G derives x. We have developed a hardware generator that creates a Verilog HDL source to perform the CKY parsing for an...
متن کاملAccelerating Somewhat Homomorphic Evaluation using FPGAs
After being introduced in 2009, the first fully homomorphic encryption (FHE) scheme has created significant excitement in academia and industry. Despite rapid advances in the last 6 years, FHE schemes are still not ready for deployment due to an efficiency bottleneck. Here we introduce a custom hardware accelerator optimized for a class of reconfigurable logic to bring LTV based somewhat homomo...
متن کاملAccelerating Lattice Reduction with FPGAs
We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementation of KFP specifically targeting cryptographically relevant dimensions. In order to optimize this implementation, we theoretically and experimentally study several facets of KFP, including its efficient parallelization and...
متن کاملThe GOmputer: Accelerating GO with FPGAs
GO is a very popular board game, especially in the Asian world. In contrast to chess programs that are able to compete with human top players, GO programs are still rather weak. Game theory classifies GO and chess as deterministic twoperson zero-sum games with perfect information, which allows to address them with game tree search techniques such as the α/β algorithm. In principle, these games ...
متن کاملAccelerating Seismic Computations Using Customized Number Representations on FPGAs
The oil and gas industry has an increasingly large demand for high-performance computation over huge volume of data. Compared to common processors, field-programable gate arrays (FPGAs) can boost the computation performance with a streaming computation architecture and the support for application-specific number representation. With hardware support for reconfigurable number format and bit widt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Micro
سال: 2021
ISSN: ['1937-4143', '0272-1732']
DOI: https://doi.org/10.1109/mm.2021.3075848